منابع مشابه
Breakpoint Distance and PQ-Trees
The PQ-tree is a fundamental data structure that can encode large sets of permutations. It has recently been used in comparative genomics to model ancestral genomes with some uncertainty: given a phylogeny for some species, extant genomes are represented by permutations on the leaves of the tree, and each internal node in the phylogenetic tree represents an extinct ancestral genome, represented...
متن کاملPC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent partial embeddings of planar graphs. PQ-trees were invented by Booth and Lueker [1] to test the consecutive ones property in matrices. The original implementation of the PQ-tree algorithms by Booth and Lueker using nine t...
متن کاملMinimax Programs, Bitonic Columns and Pq Trees
1 Overview Among hard combinatorial optimization problems there is an increasing body of special cases known in which optimal solutions can be obtained eeciently. These special cases may be expressed as constraints on graph structure, such as chordal or interval graphs 4, 6] which allow linear-time solution of problems like vertex coloring, or Monge matrix edge weights which allow eecient solut...
متن کاملPlanarity Algorithms via PQ-Trees
We give a linear-time planarity test that unifies and simplifies the algorithms of Shih and Hsu and Boyer and Myrvold; in our view, these algorithms are really one algorithm with different implementations. This leads to a short and direct proof of correctness without the use of Kuratowski’s theorem. Our planarity test extends to give a uniform random embedding, to count embeddings, to represent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2020
ISSN: 0890-5401
DOI: 10.1016/j.ic.2020.104584